Graphs uniquely hamiltonian-connected from a vertex
نویسندگان
چکیده
منابع مشابه
A Survey of Graphs Hamiltonian - Connected from a Vertex
A graph G is called hamiltonian-<:onnectedfrom a vertex v ifa hamiltonian path exists from v to every other vertex w ~ v. We present a survey of the main results known about such graphs, including a section on graphs uniquely hamiltonian-connected from a venex and a section on the computational complexity ofdetermining whether a given graph is hamiltonian-<:onnectedfrom a venex or uniquely hami...
متن کاملPseudo-Hamiltonian-connected graphs
Given a graph G and a positive integer k, denote by G[k] the graph obtained from G by replacing each vertex of G with an independent set of size k. A graph G is called pseudo-k Hamiltonian-connected if G[k] is Hamiltonian-connected, i.e., every two distinct vertices of G[k] are connected by a Hamiltonian path. A graph G is called pseudo Hamiltonian-connected if it is pseudo-k Hamiltonian-connec...
متن کاملHamiltonian-connected graphs
For a simple graph G, let NC D(G) = min{|N (u) ∪ N (v)| + d(w) : u, v, w ∈ V (G), uv 6∈ E(G), wv or wu 6∈ E(G)}. In this paper, we prove that if NC D(G) ≥ |V (G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended. c © 2008 Published by Elsevier Ltd
متن کاملHamiltonian Connected Line Graphs
Thomassen conjectured [8] that every 4-connected line graph is hamiltonian. An hourglass is a graph isomorphic to K5−E(C), where C is a cycle of length 4 in K5. In [2], it is shown that every 4-connected line graph without an induced subgraph isomorphic to the hourglass is hamiltonian connected. In this note, we prove that every 3-connected, essentially 4-connected hourglass-free line graph is ...
متن کاملAlgebraic characterization of uniquely vertex colorable graphs
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-colorability of a graph G is equivalent to the condition 1 ∈ IG,k for a certain ideal IG,k ⊆ k[x1, . . . , xn]. In this paper, we extend this result by proving a general decomposition theorem for IG,k . This theorem allows us to giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90151-1